Delay on Broadcast Erasure Channels Under Random Linear Combinations
نویسندگان
چکیده
منابع مشابه
Delay Optimal Scheduling for Chunked Random Linear Network Coding Broadcast
We study the broadcast transmission of a single file to an arbitrary number of receivers using Random Linear Network Coding (RLNC) in a network with unreliable channels. Due to the increased computational complexity of the decoding process (especially for large files) we apply chunked RLNC (i.e. RLNC is applied within non-overlapping subsets of the file). In our work we show the optimality of t...
متن کاملAn Optimal Adaptive Network Coding Scheme for Minimizing Decoding Delay in Broadcast Erasure Channels
We are concerned with designing feedback-based adaptive network coding schemes with the aim of minimizing decoding delay in each transmission in packet-based erasure networks. We study systems where each packet brings new information to the destination regardless of its order and require the packets to be instantaneously decodable. We first formulate the decoding delay minimization problem as a...
متن کاملRandom Linear Network Codes for Secrecy over Wireless Broadcast Channels
We consider a set of n messages and a group of k clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method for secretly delivering each message to its privileged recipients in a way that each receiver can decode its own messages but not the others’. Our method is based...
متن کاملReliability of Broadcast Communications Under Sparse Random Linear Network Coding
Abstract—Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern o...
متن کاملOptimal Linear Network Coding When 3 Nodes Communicate Over Broadcast Erasure Channels with ACK
This work considers the following scenario: Three nodes {1, 2, 3} would like to communicate with each other by sending packets through unreliable wireless medium. We consider the most general unicast traffic demands. Namely, there are six co-existing unicast flows with rates (R1→2, R1→3, R2→1, R2→3, R3→1, R3→2). When a node broadcasts a packet, a random subset of the other two nodes will receiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2634007